Non-redundant Search Patterns in Log-search Motion Estimation

Motion estimation is still the step in a video coding scheme that requires the largest part of the available computational resources. Many paths have been tried to reduce the computational complexity of the motion estimation step. Here we will describe how it can be reduced for log-search motion estimation by a simple change of search strategy. We will also examine how multiple search paths influence the performance of the motion estimation algorithm. Search patterns for log-search on a hexagonal grid are also suggested.